Axiomatic Foundations of Acceptability Semantics
نویسندگان
چکیده
An argument is a reason or justification of a claim. It has an intrinsic strength and may be attacked by other arguments. Hence, the evaluation of its overall strength becomes mandatory, especially for judging the reliability of its claim. Such an evaluation is done by acceptability semantics. The aim of this paper is to set up the foundations of acceptability semantics. Foundations are important not only for a better understanding of the evaluation process in general, but also for clarifying the basic assumptions underlying semantics, for comparing different (families of) semantics and identifying families of semantics that have not been explored yet. The paper defines the building blocks of a semantics. It introduces key concepts and principles on which an evaluation is based. Each concept (principle) is described by an axiom. We investigate properties of semantics that satisfy the axioms, show the foundations of the two crucial notions of reinstatement and defence, and analyse some existing semantics against the axioms.
منابع مشابه
Differential Equations via Temporal Logic and Infinitesimals 15-824 Foundations of Cyber-Physical Systems
We present a temporal logic for reasoning about differential equations which expresses differential behavior via a time domain with a nilpotent (specifically, nilsquare) infinitesimal, an element ε > 0 for which ε = 0. We define a language and axiomatic system as well as a semantics using the ring of dual numbers R[ε].
متن کاملSound Foundations for Effective Proofs of Programs
When considering the correctness of programs, the only absolute demonstration of quality is mathematical proof. Yet the complexity of these proofs makes them all but impossible both to construct and read, and the correctness of the proofs themselves come into question. We take an approach to the creation of these proofs based on specifying an axiomatic semantics for the programming language, an...
متن کاملMechanized Semantics of Simple Imperative Programming Constructs
In this paper a uniform formalization in PVS of various kinds of semantics of imper ative programming language constructs is presented Based on a comprehensive de velopment of xed point theory the denotational semantics of elementary constructs of imperative programming languages are de ned as state transformers These state transformers induce corresponding predicate transformers providing a me...
متن کاملArgumentation for Practical Reasoning: An Axiomatic Approach
An argument system could be viewed as a pair of a set of argument and a binary attack relation between arguments. The semantics of argumentation rests on the acceptability of arguments and the structure of arguments and their attack relations. While there is a relatively good understanding of the acceptability of arguments, the same can not be said about their structure and attack relations. In...
متن کاملArg-LPNMR 2016 Proceedings
An argument is a reason or justification of a claim. It has an intrinsic strength and may be attacked by other arguments. Hence, the evaluation of its overall strength is mandatory. Such an evaluation is done by acceptability semantics. In this talk, we provide the foundations of a semantics, i.e., key concepts and principles on which an evaluation is based. Each concept (principle) is describe...
متن کامل